Description: 载入txt文件迷宫，含几种搜索方法，例如depth first search, breadth first search等-maze included txt file containing several search methods, such as depth first search, breadth first search, etc. Platform: |
Size: 14336 |
Author:黄丽雯 |
Hits:
Description: 实现了图的搜索算法，包括深度优先搜索，广度优先搜索，Dijstra算法，A*算法等较典型的搜索算法，同时可以进行图的输入和编辑等操作，仅供大家参考。-achieve the plan's search algorithm, including depth-first search, breadth- first search algorithm Dijstra, A* algorithm is more typical search algorithm, and can map the input and editing operation, only for reference. Platform: |
Size: 96256 |
Author:王墨村 |
Hits:
Description: Implemented BFS, DFS and A*
To compile this project, use the following command:
g++ -o search main.cpp
Then you can run it:
./search
The input is loaded from a input file in.txt
Here is the format of the input file:
The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm.
The second line of input file shoud be an integer m indicate the number of connections for the map.
Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist.
The following input are for A*
The following line contains two chars indicate the source and destination city for A* algorithm.
Then there is an integer h indicate the number of heuristic.
The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
-Implemented BFS, DFS and A* To compile this project, use the following command: g++-O search main.cppThen you can run it:./SearchThe input is loaded from a input file in.txtHere is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm.Then there is an integer h indicate the number of heuristic.The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist. Platform: |
Size: 3072 |
Author:bo |
Hits:
Description: 用图形用户界面表示的图，数据结构基本应用，最小生成树算法，最短路径，广度、深度优先搜索-graphical user interface with the plan said, the basic data structure application, the minimum spanning tree algorithm, the shortest path, breadth, depth-first search Platform: |
Size: 61440 |
Author:张旭 |
Hits:
Description: 用CUDA实现BFS算法源码。CUDA是NV公司基于GPU的统一计算架构，BFS复杂度由CPU上的O(V+E)降为O(diameter)，直径diameter即图中root到leaf的最长距离。-This is the algorithm of BFS(breadth first search) on CUDA, and its time complexity is down to O(diameter) which diameter means the longest distance between the root and the leaves. Platform: |
Size: 1024 |
Author:iJuliet |
Hits:
Description: 一个python程序，实现了无向图的结构模拟，以及广度优先搜索的算法，以及显示最短路径之一。用leo+ulipad实现。-A python program to realize the structure of an undirected graph simulation, as well as the breadth-first search algorithm, and display one of the shortest path. By leo+ ulipad achieved. Platform: |
Size: 2048 |
Author:周鹏 |
Hits:
Description: 2． 设计一个程序，实现文件查找。文件查找操作是一项非常基本的操作，一般的文件查找操作采用递归算法，实际上是采用“深度优先”的策略。请设计一个基于“广度优先”算法的文件查找程序。
提示：由于要找的文件往往距离待查文件夹最近的文件加中。因此，基于“广度优先”算法的文件查找的效率会优于“深度优先”算法。可以将待搜索的文件夹放入一个队列，然后列出该文件夹下所有成员：如果是文件，则与查找条件进行匹配；如果是文件夹，则将其放入队列。在次从队列头取文件夹，执行同样逻辑，直到队列为空。
- Design a program, implementation file search. File search operation is a very basic operating, general file search operation recursively algorithm, is actually use "depth-first" strategy. Please design a based on "breadth first search program files" algorithm. Platform: |
Size: 1024 |
Author:guang |
Hits:
Description: c语言，算法，对指定文件夹进行广度优先搜索，输出文件名-C language, algorithm, for the specified folder is breadth first search, the output file name Platform: |
Size: 72704 |
Author:嘎嘎 |
Hits:
Search - Breadth-first search